package Search;

import java.util.ArrayList;

import Main.Node;

public abstract class Problem {

	static boolean trace;

	// Operators
	ArrayList<Character> operators;

	// initial State
	Node initialState;

	// state space :: All states of Nodes Compressed to Strings that could be
	// expanded (Mem and other)
	static ArrayList<String> Mem = new ArrayList<String>();

	// Goal Test ..
	public static boolean Solved(Node currNode) {
		int[][] b = currNode.getBoard().getB();
		for (int i = 0; i < b.length; i++) {
			if (b[b.length / 2 - 1][i] / 10 != 0) {
				return false;
			}
		}
		solutionCost = currNode.getCostSoFar();
		return true;
	}

	// path cost function
	static int solutionCost = 0;
}
